Leap Forward Virtual Clock : A New Fair
نویسندگان
چکیده
We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the classical virtual clock and the Self-Clocked Fair Queuing schemes can be thought of as special cases of our scheme, by setting the leap forward parameter appropriately.
منابع مشابه
Leap Forward Virtual Clock : A New Fair Queuing Scheme
We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...
متن کاملLeap Forward Virtual Clock: An O(loglogN) Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness
We describe an e cient fair queuing scheme, Leap Forward Virtual Clock , that provides endto-end delay bounds almost identical to that of PGPS fair queuing, along with throughput fairness. Our scheme can be implemented with a worst-case time O(log logN ) per packet (inclusive of sorting costs), which improves upon all previously known schemes that achieve guaranteed delay and throughput fairnes...
متن کاملLeap Forward Virtual Clock : A New Fair Queuing Scheme withGuaranteed Delays and Throughput
Fair queuing is the mechanism by which routers schedule packets on output links in order to guarantee fairness and latency bounds. Fair queuing, along with with address lookup and switching, is one of the major bottlenecks for routers today. We describe an eecient fair queuing scheme, Leap Forward Virtual Clock , that provides end-to-end delay bounds and throughput fairness comparable to the be...
متن کاملLeap Forward Virtual Clock : An O ( log logN ) Fair Queuing Scheme withGuaranteed Delays and Throughput
We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds almost identical to that of PGPS fair queuing, along with throughput fairness. Our scheme can be implemented with a worst-case time O(log logN) per packet (inclusive of sorting costs), which improves upon all previously known schemes that achieve guaranteed delay and throughput fairness...
متن کاملLeap Forward Virtual Clock: an O(log Log N) Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness an O(log Log N) Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness
We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to PGPS, along with throughput fairness. Our scheme can be implemented with a worst-case time O(log log N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to PGPS. Interestingly , both...
متن کامل